On Ramsey (3K2,P3)-minimal graphs
نویسندگان
چکیده
For any given two graphs G and H, we use the notation F→(G,H) to mean that in any red-blue coloring of the edges of F , the following must hold: F contains either a red subgraph G or a blue subgraph H. A graph F is a Ramsey (G,H)minimal graph if F→(G,H) but F∗ 6→(G,H) for any proper subgraph F∗ of F . Let R(G,H) be the class of all Ramsey (G,H)-minimal graphs. In this paper, we derive the properties of graphs belonging to R(3K2,P3). By using these properties we determine all graphs belonging to this class.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملComputing the Ramsey Number $R(K_5-P_3,K_5)$
We give a computer-assisted proof of the fact that R(K5 − P3,K5) = 25. This solves one of the three remaining open cases in Hendry’s table, which listed the Ramsey numbers for pairs of graphs on 5 vertices. We find that there exist no (K5−P3,K5)-good graphs containing a K4 on 23 or 24 vertices, where a graph F is (G, H)-good if F does not contain G and the complement of F does not containH. The...
متن کاملThe Ramsey Number r(K5-P3,K5)
For two given graphs G1 and G2, the Ramsey number r(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G2. Let Km denote a complete graph of order m and Kn −P3 a complete graph of order n without two incident edges. In this paper, we prove that r(K5 − P3,K5) = 25 without help of computer algorithms.
متن کاملMulticolor Ramsey Numbers for Paths and Cycles
For given graphs G1, G2, . . . , Gk, k ≥ 2, the multicolor Ramsey number R(G1, G2, . . . , Gk) is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, then it is always a monochromatic copy of some Gi, for 1 ≤ i ≤ k. We give a lower bound for k-color Ramsey number R(Cm, Cm, . . . , Cm), where m ≥ 8 is even and Cm is the cycle on m...
متن کاملMinimum Degrees of Minimal Ramsey Graphs
For graphs F and H, we say F is Ramsey for H if every 2-coloring of the edges of F contains a monochromatic copy of H. The graph F is Ramsey H-minimal if there is no proper subgraph F ′ of F so that F ′ is Ramsey for H. Burr, Erdős, and Lovász defined s(H) to be the minimum degree of F over all Ramsey H-minimal graphs F . Define Ht,d to be a graph on t+ 1 vertices consisting of a complete graph...
متن کامل